A Survey on Efficient Rational Sampling Rate Conversion Algorithms
نویسندگان
چکیده
In many practical applications of digital signal processing sampling rate conversion is a problem. The process of converting a signal from a given rate to a different rate is called Sampling Rate Conversion. Sampling rate conversion process may be based on an integer or a rational factor. In this paper, the process of rational sampling rate conversion is discussed in detail. Along with this, a complete survey of efficient structures for implementing the sampling-rate conversion by a rational factor of L/M is presented.
منابع مشابه
Sampling Rate Conversion in the Discrete Linear Canonical Transform Domain
Sampling rate conversion (SRC) is one of important issues in modern sampling theory. It can be realized by up-sampling, filtering, and down-sampling operations, which need large complexity. Although some efficient algorithms have been presented to do the sampling rate conversion, they all need to compute the N-point original signal to obtain the up-sampling or the down-sampling signal in the tim...
متن کاملRational Sampling Rate Converter Design Analysis using Symmetric Technique
In this paper we proposed an efficient structure for sampling rate conversion by rational factor of L/M, where L is upsampling factor and M is downsampling factor. In this method, the coefficient symmetry of the linear phase filter is used. In this way, the number of required multiplications per output sample is reduced. For implementation we use linear phase FIR filter. The symmetric FIR filte...
متن کاملA New Approach to Design an Efficient CIC Decimator Using Signed Digit Arithmetic
Any digital processing performed on a signal with larger nyquist interval requires more computation than signal processing performed on smaller nyquist interval. The sampling rate alteration generates the unwanted effects in the system such as spectral aliasing and spectral imaging during signal processing. Multirate-multistage implementation of digital filter can result a significant computati...
متن کاملEfficient arbitrary sampling rate conversion with recursive calculation of coefficients
In this paper, we present a novel algorithm for sampling rate conversion by an arbitrary factor. Theoretically, sampling rate conversion of a discrete-time (DT) sequence can be performed by converting the sequence to a series of continuous-time (CT) impulses. This series of impulses is filtered with a CT lowpass filter, and the output is then sampled at the desired rate. If the CT filter is cho...
متن کاملFast Computation by Subdivision of Multidimensional Splines and Their Applications
We present theory and algorithms for fast explicit computations of uniand multi-dimensional periodic splines of arbitrary order at triadic rational points and of splines of even order at diadic rational points. The algorithms use the forward and the inverse Fast Fourier transform (FFT). The implementation is as fast as FFT computation. The algorithms are based on binary and ternary subdivision ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017